Broadcasting in Random Graphs
نویسندگان
چکیده
We do a probabilistic analysis of the problem of distributing a single piece of information to the vertices of a graph G. Assuming that the input graph G is Gn,p, we prove an O(lnn/n) upper bound on the edge density needed so that with high probability the information can be broadcast in ⌈log2 n⌉ rounds.
منابع مشابه
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs th...
متن کاملApproximation Algorithms for Minimum Time Broadcast
This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an O(vfvT)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log n/ log log n) (multiplicative) ratio approximation is given ...
متن کاملApproximation Algorithms for Minimum
This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs, as well as for several restricted graph classes. In particular, an O(p n)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log log n= log n) (multiplicative) ratio approximation is given ...
متن کاملOn Randomized Broadcasting in Power Law Networks
Broadcasting algorithms have various range of applications in different fields of computer science. In this paper we consider randomized broadcasting algorithms in power law graphs which are often used to model large scale real world networks such as the Internet. We prove that for certain (truncated) power law networks there exists a time efficient randomized broadcasting algorithm whose commu...
متن کاملOn the Runtime and Robustness of Randomized Broadcasting
In this paper, we study the following randomized broadcasting protocol. At some time t an information r is placed at one of the nodes of a graph. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it. We begin by developing tight lower and upper bounds on the runtime of the algorithm descri...
متن کاملOn Radio Broadcasting in Random Geometric Graphs
One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper we consider radio broadcasting in random geometric graphs, in which n nodes are placed uniformly at random in [0, √ n], and there is a (directed) edge from a node u to a node v in the corresponding graph iff the distance between u and v is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 54 شماره
صفحات -
تاریخ انتشار 1994